Fully Dynamic Betweenness Centrality
نویسندگان
چکیده
We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν∗ · log n) time per update with our basic algorithm, and O(ν∗ · log n) time with a more complex algorithm, where n = |V |, and ν∗ bounds the number of distinct edges that lie on shortest paths through any single vertex. For graphs with ν∗ = O(n), our algorithms match the fully dynamic all pairs shortest paths (APSP) bounds of Demetrescu and Italiano [8] and Thorup [28] for unique shortest paths, where ν∗ = n − 1. Our first algorithm also contains within it, a method and analysis for obtaining fully dynamic APSP from a decremental algorithm, that differs from the
منابع مشابه
Fully-Dynamic Approximation of Betweenness Centrality
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previou...
متن کاملApproximating Betweenness Centrality in Fully Dynamic Networks
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Because exact computations are prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in networks that change over ti...
متن کاملFully Dynamic Betweenness Centrality Maintenance on Massive Networks
Measuring the relative importance of each vertex in a network is one of the most fundamental building blocks in network analysis. Among several importance measures, betweenness centrality, in particular, plays key roles in many real applications. Considerable effort has been made for developing algorithms for static settings. However, real networks today are highly dynamic and are evolving rapi...
متن کاملEfficient algorithms for updating betweenness centrality in fully dynamic graphs
Betweenness centrality of a vertex (edge) in a graph is a measure for the relative participation of the vertex (edge) in the shortest paths in the graph. Betweenness centrality is widely used in various areas such as biology, transportation, and social networks. In this paper, we study the update problem of betweenness centrality in fully dynamic graphs. The proposed update algorithm substantia...
متن کاملFaster Betweenness Centrality Updates in Evolving Networks
Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction of shortest paths going though it. Due to the dynamic nature of many today’s networks, algorithms that quickly update centrality scores have become a necessity. For betweenness, several dynamic algorithms have been pro...
متن کاملA Faster Algorithm for Fully Dynamic Betweenness Centrality
We present a new fully dynamic algorithm for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν · log n) time per update, where n = |V | and ν bounds the number of distinct edges that lie on shortest paths through any single vertex. This...
متن کامل